ODES: an overlapping dense sub-graph algorithm
نویسندگان
چکیده
منابع مشابه
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a new association between two vertices is compatible by considering the structure of their local neighborhoods, represented as the number of limited-length paths of different type originating from each vertex. In addition, rando...
متن کاملUncertain Attribute Graph Sub-Graph Isomorphism and its Determination Algorithm
The expectative sub-graph isomorphism of uncertain attribute graph is based on the analysis of complex network structure and the characteristic of uncertain attribute graph. The expectative sub-graph isomorphism of uncertain attribute graph is only one threshold value as constraint conditions. The method is simple, but the computation is large amount. Therefore, this paper brings in the definit...
متن کاملA new algorithm for removing node overlapping in graph visualization
Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, particularly in dynamic graph visualization. Providing a formal description of this problem, this paper presents a new approach called the Force-Transfer algorithm that removes node overlaps. Compared to other methods, ...
متن کاملA Parallel Overlapping Time-Domain Decomposition Method for ODEs
We introduce an overlapping time-domain decomposition for linear initial-value 7 problems which gives rise to an efficient solution method for parallel computers without 8 resorting to the frequency domain. This parallel method exploits the fact that homogeneous 9 initial-value problems can be integrated much faster than inhomogeneous problems by using 10 an efficient Arnoldi approximation for ...
متن کاملAn Algorithm for ODES from Atmospheric Dispersion Problems
The solution of large systems of ordinary differential equations o.d.e.s, arising from atmospheric dispersion problems is considered. An algorithm using a method due to Klopfenstein is adopted as the main method and combined with an approximate Jacobian factorisation and a Gauss-Seidel iteration to provide an efficient solver. The approach is contrasted with that of using implicit-explicit mult...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2010
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btq514